Regular Star Complements in Strongly Regular Graphs
نویسنده
چکیده
We prove that, aside from the complete multipartite graphs and graphs of Steiner type, there are only finitely many connected strongly regular graphs with a regular star complement of prescribed degree s ∈ IN . We investigate the possible parameters when s ≤ 5. AMS Classification: 05C50
منابع مشابه
Star Complements in Regular Graphs: Old and New Results
We survey results concerning star complements in finite regular graphs, and note the connection with designs and strongly regular graphs in certain cases. We include improved proofs along with new results on stars and windmills as star complements. AMS Classification: 05C50
متن کاملAn Example of Using Star Complements in Classifying Strongly Regular Graphs∗
In this paper we show how the star complement technique can be used to reprove the result of Wilbrink and Brouwer that the strongly regular graph with parameters (57, 14, 1, 4) does not exist.
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملCo-cliques and star complements in extremal strongly regular graphs
Suppose that the positive integerμ is the eigenvalue of largest multiplicity in an extremal strongly regular graph G. By interlacing, the independence number of G is at most 4μ2 + 4μ− 2. Star complements are used to show that if this bound is attained then either (a) μ = 1 and G is the Schläfli graph or (b) μ = 2 and G is the McLaughlin graph. © 2006 Elsevier Inc. All rights reserved. AMS class...
متن کاملClassification of regular two-graphs on 36 and 38 vertices
In a previous paper an incomplete investigation into regular two-graphs on 36 vertices established the existence of at least 227. Using a more efficient algorithm, the two authors have independently verified that in fact these 227 comprise the complete set. An immediate consequence of this is that all strongly regular graphs with parameters (35,16,6,8), (36,14,4,6), (36,20,10,12) and their comp...
متن کامل